On the average Steiner 3-eccentricity of trees
نویسندگان
چکیده
The Steiner k -eccentricity of a vertex v graph G is the maximum distance over all -subsets V ( ) which contain . In this paper 3-eccentricity studied on trees. Some general properties trees are given. A tree transformation does not increase average As its application, several lower and upper bounds for derived.
منابع مشابه
On the Average Height of b-Balanced Ordered Trees
An ordered tree with height h is b-balanced if all its leaves have a level l with h − b <= l <= h, where at least one leaf has a level equal to h − b. For large n, we shall compute asymptotic equivalents to the number of all b-balanced ordered trees with n nodes and of all such trees with height h. Furthermore, assuming that all b-balanced ordered trees with n nodes are equally likely, we shall...
متن کاملAverage Degree-Eccentricity Energy of Graphs
The concept of average degree-eccentricity matrix ADE(G) of a connected graph $G$ is introduced. Some coefficients of the characteristic polynomial of ADE(G) are obtained, as well as a bound for the eigenvalues of ADE(G). We also introduce the average degree-eccentricity graph energy and establish bounds for it.
متن کاملOn AGX Conjectures Regarding Average Eccentricity
The eccentricity of a vertex is the maximum distance from it to another vertex and the average eccentricity ecc(G) of a graph G is the mean value of eccentricities of all vertices of G. In this paper we resolve five conjectures, obtained by the system AutoGraphiX, about the average eccentricity and other graph parameters (independence number, chromatic number and the Randić index), and refute t...
متن کاملOn the extremal properties of the average eccentricity
The eccentricity of a vertex is the maximum distance from it to another vertex and the average eccentricity ecc(G) of a graph G is the mean value of eccentricities of all vertices of G. The average eccentricity is deeply connected with a topological descriptor called the eccentric connectivity index, defined as a sum of products of vertex degrees and eccentricities. In this paper we analyze ext...
متن کاملEccentricity approximating trees
Using the characteristic property of chordal graphs that they are the intersection graphs of subtrees of a tree, Erich Prisner showed that every chordal graph admits an eccentricity 2approximating spanning tree. That is, every chordal graph G has a spanning tree T such that eccT (v) − eccG(v) ≤ 2 for every vertex v, where eccG(v) (eccT (v)) is the eccentricity of a vertex v in G (in T , respect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2021
ISSN: ['1872-6771', '0166-218X']
DOI: https://doi.org/10.1016/j.dam.2021.07.026